Search results for " permutation"
showing 10 items of 41 documents
Statistics-preserving bijections between classical and cyclic permutations
2012
Recently, Elizalde (2011) [2] has presented a bijection between the set C"n"+"1 of cyclic permutations on {1,2,...,n+1} and the set of permutations on {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. In this paper, we construct a bijection from C"n"+"1 to S"n that preserves the weak excedance set and that transfers quasi-fixed points into fixed points and left-to-right maxima into themselves. This induces a bijection from the set D"n of derangements to the set C"n"+"1^q of cycles without quasi-fixed points that preserves the weak excedance set. Moreover, we exhibit a kind of discrete continuity between C"n"+"1 and S"n that preserves at each s…
Gray code for derangements
2004
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.
Measuring spectrally-resolved information transfer.
2020
Information transfer, measured by transfer entropy, is a key component of distributed computation. It is therefore important to understand the pattern of information transfer in order to unravel the distributed computational algorithms of a system. Since in many natural systems distributed computation is thought to rely on rhythmic processes a frequency resolved measure of information transfer is highly desirable. Here, we present a novel algorithm, and its efficient implementation, to identify separately frequencies sending and receiving information in a network. Our approach relies on the invertible maximum overlap discrete wavelet transform (MODWT) for the creation of surrogate data in t…
Measuring the clustering effect of BWT via RLE
2017
Abstract The Burrows–Wheeler Transform (BWT) is a reversible transformation on which are based several text compressors and many other tools used in Bioinformatics and Computational Biology. The BWT is not actually a compressor, but a transformation that performs a context-dependent permutation of the letters of the input text that often create runs of equal letters (clusters) longer than the ones in the original text, usually referred to as the “clustering effect” of BWT. In particular, from a combinatorial point of view, great attention has been given to the case in which the BWT produces the fewest number of clusters (cf. [5] , [16] , [21] , [23] ). In this paper we are concerned about t…
Structure of AP205 Coat Protein Reveals Circular Permutation in ssRNA Bacteriophages.
2016
We are thankful to the MAX-lab staff for their support during our visit at the synchrotron.; International audience; AP205 is a single-stranded RNA bacteriophage that has a coat protein sequence not similar to any other known single-stranded RNA phage. Here, we report an atomic-resolution model of the AP205 virus-like particle based on a crystal structure of an unassembled coat protein dimer and a cryo-electron microscopy reconstruction of the assembled particle, together with secondary structure information from site-specific solid-state NMR data. The AP205 coat protein dimer adopts the conserved Leviviridae coat protein fold except for the N-terminal region, which forms a beta-hairpin in …
The clinical use of statistical permutation test methodology: a tool for identifying predictive variables of outcome.
2015
<b><i>Objectives:</i></b> To identify the predictive variables affecting the outcome after radical surgery for bladder cancer by a newer statistical methodology, i.e. nonparametric combination (NPC). <b><i>Methods:</i></b> A multicenter study enrolled 1,312 patients who had undergone radical cystectomy for bladder cancer in 11 Italian oncological centers from January 1982 to December 2002. A statistical analysis<b> </b>of their medical history and diagnostic, pathological and postoperative variables was performed using a NPC test. The<b> </b>patients were included in a comprehensive database with medical history and cli…
Finitary shadows of compact subgroups of $$S(\omega )$$
2020
AbstractLet LF be the lattice of all subgroups of the group $$SF(\omega )$$SF(ω) of all finitary permutations of the set of natural numbers. We consider subgroups of $$SF(\omega )$$SF(ω) of the form $$C\cap SF(\omega )$$C∩SF(ω), where C is a compact subgroup of the group of all permutations. In particular, we study their distribution among elements of LF. We measure this using natural relations of orthogonality and almost containedness. We also study complexity of the corresponding families of compact subgroups of $$S(\omega )$$S(ω).
Binary Hamming codes and Boolean designs
2021
AbstractIn this paper we consider a finite-dimensional vector space $${\mathcal {P}}$$ P over the Galois field $${\text {GF}}(2),$$ GF ( 2 ) , and the family $${\mathcal {B}}_k$$ B k (respectively, $${\mathcal {B}}_k^*$$ B k ∗ ) of all the k-sets of elements of $$\mathcal {P}$$ P (respectively, of $${\mathcal {P}}^*= {\mathcal {P}} \setminus \{0\}$$ P ∗ = P \ { 0 } ) summing up to zero. We compute the parameters of the 3-design $$({\mathcal {P}},{\mathcal {B}}_k)$$ ( P , B k ) for any (necessarily even) k, and of the 2-design $$({\mathcal {P}}^{*},{\mathcal {B}}_k^{*})$$ ( P ∗ , B k ∗ ) for any k. Also, we find a new proof for the weight distribution of the binary Hamming code. Moreover, we…
Comparison of discretization strategies for the model-free information-theoretic assessment of short-term physiological interactions
2023
This work presents a comparison between different approaches for the model-free estimation of information-theoretic measures of the dynamic coupling between short realizations of random processes. The measures considered are the mutual information rate (MIR) between two random processes [Formula: see text] and [Formula: see text] and the terms of its decomposition evidencing either the individual entropy rates of [Formula: see text] and [Formula: see text] and their joint entropy rate, or the transfer entropies from [Formula: see text] to [Formula: see text] and from [Formula: see text] to [Formula: see text] and the instantaneous information shared by [Formula: see text] and [Formula: see…
Multiply Transitive Permutation Groups
1982
Since the beginnings of finite group theory, the multiply transitive permutation groups have exercised a certain fascination. This is mainly due to the fact that apart from the symmetric and alternating groups not many of them were known. Only very recently final results about multiply transitive permutation groups have been proved, using the classification of all finite simple groups (see 7.5).